Cacti and filtered distributive laws

نویسندگان

  • VLADIMIR DOTSENKO
  • JAMES GRIFFIN
  • Vladimir Dotsenko
  • James Griffin
چکیده

Motivated by the second author’s construction of a classifying space for the group of pure symmetric automorphisms of a free product, we introduce and study a family of topological operads, the operads of based cacti, defined for every pointed simplicial set .Y;p/ . These operads also admit linear versions, which are defined for every augmented graded cocommutative coalgebra C . We show that the homology of the topological operad of based Y–cacti is the linear operad of based H .Y /–cacti. In addition, we show that for every coalgebra C the operad of based C–cacti is Koszul. To prove the latter result, we use the criterion of Koszulness for operads due to the first author, utilising the notion of a filtered distributive law between two quadratic operads. We also present a new proof of that criterion, which works over a ground field of arbitrary characteristic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributive laws in programming structures

Generalised Distributive laws in Computer Science are rules governing the transformation of one programming structure into another. In programming, they are programs satisfying certain formal conditions. Their importance has been to date documented in several isolated cases by diverse formal approaches. These applications have always meant leaps in understanding the nature of the subject. Howev...

متن کامل

Monad Compositions I: General Constructions and Recursive Distributive Laws

New techniques for constructing a distributive law of a monad over another are studied using submonads, quotient monads, product monads, recursively-defined distributive laws, and linear equations. Sequel papers will consider distributive laws in closed categories and will construct monad approximations for compositions which fail to be a monad.

متن کامل

Iterated distributive laws

We give a framework for combining n monads on the same category via distributive laws satisfying Yang-Baxter equations, extending the classical result of Barr and Wells which combines two monads via one distributive law. We show that this corresponds to iterating n-times the process of taking the 2-category of monads in a 2-category, extending the result of Street characterising distributive la...

متن کامل

Weak distributive laws

Distributive laws between monads (triples) were defined by Jon Beck in the 1960s; see [1]. They were generalized to monads in 2-categories and noticed to be monads in a 2-category of monads; see [2]. Mixed distributive laws are comonads in the 2-category of monads [3]; if the comonad has a right adjoint monad, the mate of a mixed distributive law is an ordinary distributive law. Particular case...

متن کامل

Distributive laws for the coinductive solution of recursive equations

This paper illustrates the relevance of distributive laws for the solution of recursive equations, and shows that one approach for obtaining coinductive solutions of equations via infinite terms is in fact a special case of a more general approach using an extended form of coinduction via distributive laws.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015